Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

s1(s1(s0(s0(x)))) → s0(s0(s0(s1(s1(s1(x))))))

Q is empty.


QTRS
  ↳ RFCMatchBoundsTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

s1(s1(s0(s0(x)))) → s0(s0(s0(s1(s1(s1(x))))))

Q is empty.

Termination of the TRS R could be shown with a Match Bound [6,7] of 4. This implies Q-termination of R.
The following rules were used to construct the certificate:

s1(s1(s0(s0(x)))) → s0(s0(s0(s1(s1(s1(x))))))

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 2, 7, 6, 5, 4, 3, 12, 11, 10, 9, 8, 17, 16, 15, 14, 13, 22, 21, 20, 19, 18, 27, 26, 25, 24, 23, 32, 31, 30, 29, 28, 37, 36, 35, 34, 33, 42, 41, 40, 39, 38

Node 1 is start node and node 2 is final node.

Those nodes are connect through the following edges: